Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization
نویسندگان
چکیده
منابع مشابه
An Improved and Simplified Full-Newton Step O(n) Infeasible Interior-Point Method for Linear Optimization
We present an improved version of an infeasible interior-point method for linear optimization published in 2006. In the earlier version each iteration consisted of one so-called feasibility step and a few – at most three – centering steps. In this paper each iteration consists of only a feasibility step, whereas the iteration bound improves the earlier bound by a factor 2 √ 2. The improvements ...
متن کاملA Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
We present a full-Newton step infeasible interior-point algorithm. It is shown that at most O(n) (inner) iterations suffice to reduce the duality gap and the residuals by the factor 1 e . The bound coincides with the best known bound for infeasible interior-point algorithms. It is conjectured that further investigation will improve the above bound to O( √ n).
متن کاملA Second Full - Newton Step O ( n ) Infeasible Interior - Point Algorithm for Linear Optimization ∗
In [4] the second author presented a new primal-dual infeasible interior-point algorithm that uses full-Newton steps and whose iteration bound coincides with the best known bound for infeasible interior-point algorithms. Each iteration consists of a step that restores the feasibility for an intermediate problem (the so-called feasibility step) and a few (usual) centering steps. No more than O(n...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2009
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-009-9634-0